Asymptotic bounded consensus tracking of double-integrator multi-agent systems with bounded-jerk target based on sampled-data without velocity measurements
Wu Shuang-Shuang, Wu Zhi-Hai, Peng Li, Xie Lin-Bo
Engineering Research Center of Internet of Things Technology Applications of the Ministry of Education, School of Internet of Things Engineering, Jiangnan University, Wuxi 214122, China

 

† Corresponding author. E-mail: wuzhihai@jiangnan.edu.cn

Abstract

This paper investigates asymptotic bounded consensus tracking (ABCT) of double-integrator multi-agent systems (MASs) with an asymptotically-unbounded-acceleration and bounded-jerk target (AUABJT) available to partial agents based on sampled-data without velocity measurements. A sampled-data consensus tracking protocol (CTP) without velocity measurements is proposed to guarantee that double-integrator MASs track an AUABJT available to only partial agents. The eigenvalue analysis method together with the augmented matrix method is used to obtain the necessary and sufficient conditions for ABCT. A numerical example is provided to illustrate the effectiveness of theoretical results.

1. Introduction

Recently, cooperative control of MASs has been widely studied because of its broad applications including swarming,[1] flocking,[2,3] rendezvous,[4] formation control,[5,6] target pursuit,[7,8] and automated highway systems. As a fundamental problem in cooperative control of MASs, consensus means that all agents under properly distributed control inputs, called a consensus protocol, converge to a common value. Many consensus protocols have been proposed for single-integrator MASs.[915] However, many agents such as underwater robots are controlled to achieve a desired motion by their accelerations rather than their velocities in reality. Therefore, there is a need to investigate consensus of double-integrator MASs. For many existing consensus protocols for double-integrator MASs, the eventual value to be reached is a function of all agents’ initial states, which is unknown in advance. This is often called the χ-consensus problem.[16] However, in some practical applications, all agents might be required to track a common moving target. This is often called the consensus tracking (CT) problem. Since the protocols about the χ-consensus cannot be directly used to solve the CT problems, proper consensus tracking protocols (CTPs) for double-integrator MASs should be proposed. Considerable efforts have been made on the CT of double-integrator MASs, where main topics include delays,[1719] robustness,[1921] finite-time convergence,[2123] and containment control.[24,25]

References [17] and [25] about the CT of double-integrator MASs assumed that continuous-time CTPs are used to guarantee the CT of double-integrator MASs. However, in many cases, when a continuous-time system is equipped with digital sensors and controllers, only sampled-data can be used to synthesise the control laws. Hence, it is important to consider sampled-data-based CT of double-integrator MASs. Recently, references [26]–[32] investigated sampled-data-based CT of double-integrator MASs. Particularly, it was proved in Ref. [32] that when a communication topology is undirected and fixed and there are paths from the target to all agents, choosing an appropriate sampling period can guarantee double-integrator MASs to track an asymptotically unbounded-acceleration and bounded-jerk target (AUABJT) available to only partial agents by using the proposed sampled-data CTP. It is easy to see from the sampled-data CTP proposed in Ref. [32] that each agent needs to know its own and neighbours’ positions and velocities. However, in some practical situations, to save hardware costs, an agent is often not equipped with a velocity sensor. For an agent without a velocity sensor, its velocity information cannot be measured and is thus unavailable to itself and its neighbours. In this case, the sampled-data CTP in Ref. [32] cannot be directly applied to the CT of double-integrator MASs with an AUABJT available to only partial agents based on sampled-data without velocity measurements. Therefore, a question arises that how we can devise a sampled-data CTP without velocity measurements to guarantee that double-integrator MASs track an AUABJT available to only partial agents.

To answer the above question, we propose a sampled-data CTP without velocity measurements by using the numerical derivatives of an agent's and an AUABJT's positions to estimate their velocities. We have theoretically proved and numerically illustrated that the proposed sampled-data CTP without velocity measurements is effective to guarantee that double-integrator MASs with an AUABJT available to only partial agents achieve asymptotic bounded consensus tracking (ABCT).

2. Preliminaries and problem formulation
2.1. Algebraic graph theory and some notations

Consider a weighted undirected graph , where , with edge elements and with nonnegative adjacency elements a ij are the node set, the edge set and the weighted adjacency matrix, respectively. Assume that and . The neighbour set and the degree of node v i are denoted by and , respectively. is the Laplacian matrix of G. Certainly, all row sums of L are zero and thus , where and .[33] A path from node v i to node v j is a sequence composed of distinct edges. A graph is said to be connected if there exists a path between any of its two distinct nodes.

Following are some notations used in this paper. O N and I N represent the N-dimensional zero matrix and the N-dimensional identity matrix, respectively. The 2-norm and the transpose of a vector or matrix are denoted by and , respectively. The eigenvalues, the largest eigenvalue, the spectral radius and the determinant of an N-dimensional matrix are denoted by , , , and , respectively.

2.2. Consensus tracking protocols and some lemmas

Consider MASs with N agents, where each agent's dynamics is

(1)
where , , and represent the position, the velocity, and the control input of the i-th agent, respectively. The target's dynamics to be tracked is
where , , and are the position, the velocity, and the acceleration of the target, respectively.

To better introduce the issue to be considered, we provide the following definition and assumptions.

In Ref. [32], the authors proved that under Assumptions 1 and 2, the systems (1) using the protocol

(2)
can achieve ABCT, provided the sampling period is appropriately chosen, where represents the sampling period, all of , , and represent feedback gains, if the i-th agent can directly obtain the target's information and otherwise.

The protocol (2) requires that each agent can obtain the positions and velocities of itself, its neighbours and the target if the target is available to the agent. To deal with the case when the velocity cannot be measured, inspired by Ref. [34], we propose the protocol without velocity measurements

(3)
It can be seen from the protocol (3) that each agent only uses the position information from itself, its neighbours and the target if the target is available to it for constructing its control input. Thus, the protocol (3) is independent of velocity measurements.

To derive the main results, we provide the lemmas below.

All roots of with are within the unit circle if and only if , , , , and are satisfied simultaneously.[35]

3. Convergence analysis

In this section, we theoretically demonstrate the effectiveness of the protocol (3). Main results are provided below.

4. Simulations

In this section, we provide a numerical example to demonstrate the effectiveness of the protocol (3). Consider MASs with five agents, whose communication topology is provided in Fig. 1, where the target is labelled as 0.

Fig. 1. Communication topology.

Without loss of generality, we assume that all weights of edges are 1. The initial states of five agents are randomly set. It can be verified that when , (4)–(6) hold simultaneously. Figure 2 illustrates the numerical results.

Fig. 2. (color online) Positions and velocities of systems (1) under protocol (3) with and .

It is clear from Fig. 2 that the positions and velocities of all agents converge to the position and velocity of the target in the asymptotical and bounded sense. This means that the systems (1) under the protocol (3) achieve ABCT. This numerically illustrates the effectiveness of the protocol (3).

5. Conclusions

In this paper, we considered ABCT of double-integrator MASs with an AUABJT available to partial agents based on sampled-data without velocity measurements. We proposed a sampled-data CTP without velocity measurements and proved that the proposed protocol is effective to guarantee that double-integrator MASs with an AUABJT available to only partial agents achieve ABCT. In this paper, to overcome the difficulties caused by the unavailability of velocity information we used the numerical derivatives of an agent's and an AUABJT's positions to estimate their velocities. Recently, some distributed estimation-based CTPs have been proposed to solve CT of MASs with partial measurements.[3639] Motivated by the methods in Refs. [36]–[39], in the future we intend to design appropriately distributed estimation-based CTPs without velocity measurements to deal with the issue considered in this paper. In this paper, we assumed the communication topology to be undirected and fixed. Considering that the communication topology might be directed and switching in some real situations, we will extend this paper's results to the case of a directed switching communication topology.

Uncited references

[2731]

Reference
1 Wang L S Wu Z H 2014 Chin. Phys. B 23 098901
2 Su H S Wang X F Lin Z L 2009 IEEE Trans. Autom. Control 54 293
3 Su H S Wang X F Chen G R 2009 Inter. J. Control 82 1334
4 Qi B Cui B T Lou X Y 2014 Chin. Phys. B 23 110501
5 Luo X Y Han N N Guan X P 2010 Chin. Phys. B 19 100202
6 Cao J F Ling Z H Yuan Y F Gao C 2014 Chin. Phys. B 23 070509
7 Yan J Guan X P Luo X Y 2011 Chin. Phys. B 20 018901
8 Yan J Guan X P Luo X Y 2011 Chin. Phys. B 20 048901
9 Sun Y Z Ruan J 2008 Chin. Phys. B 17 4137
10 Tan F X Guan X P Liu D R 2008 Chin. Phys. B 17 3531
11 Song H Y Yu L Hu H X Zhang W A 2012 Chin. Phys. B 21 028901
12 Wu Z H Peng L Xie L B Wen J W 2012 Chin. Phys. B 21 128902
13 Wu Z H Peng L Xie L B Wen J W 2013 Chin. Phys. B 22 128901
14 Ji L H Liao X F 2013 Chin. Phys. B 22 040203
15 Sun F L Zhu W 2013 Chin. Phys. B 22 110204
16 Cortés J 2008 Automatica 44 726
17 Hu J P Hong Y G 2007 Physica A 374 853
18 Zhu W Cheng D Z 2010 Automatica 46 1994
19 Du H B Li S H Shi P 2012 Inter. J. Control 85 1913
20 Hu G Q 2012 Syst. Control Lett. 61 134
21 Li S H Du H B Lin X Z 2011 Automatica 47 1706
22 Cao Y C Ren W Meng Z Y 2010 Syst. Control Lett. 59 522
23 Lu X Q Chen S H LüJ H 2013 IET Control Theory Appl. 7 1562
24 Lou Y C Hong Y G 2012 Automatica 48 879
25 Wang Y Cheng L Hou Z G Tan M Wang M 2014 Automatica 50 1922
26 Wu Z H Peng L Xie L B Wen J W 2012 J. Intell. Robot. Syst. 68 261
27 Wu Z H Peng L Xie L B Wen J W 2014 Int. J. Control Autom. Syst. 12 44
28 Wu Z H Peng L Xie L B Wen J W 2015 Int. J. Syst. Sci. 46 546
29 Cheng Y L Xie D M 2013 Inter. J. Control 86 923
30 Cheng Y L Xie D M 2014 Inter. J. Control 87 41
31 Xie D M Cheng Y L 2015 Int. J. Robust Nonlinear Control 25 252
32 Wu Z H Peng L Xie L B Wen J W 2015 IET Control Theory Appl 9 1909
33 Horn R A Jornson C R 1985 Matrix Analysis New York Cambridge University
34 Gao Y P Wang L Xie G M Wu B 2009 Inter. J. Control 82 2193
35 Jury E I 1964 Theory and Application of the z-Transform Method New York Wiley
36 Tang Z J Huang T Z Shao J L Hu J P 2011 IET Control Theory Appl. 5 1658
37 Hu J P Feng G 2011 Asian J. Control 13 988
38 Hu J P Zheng W X 2014 Automatica 50 1416
39 Hu J P Geng J Zhu H 2015 Commun. Nonlinear Sci. Numer. Simul. 20 559